Spectral subtraction using elliptic integral for multiplication factor
نویسنده
چکیده
Spectral subtraction(SS) has been used for speech recognition in noisy environments. The maximum likelihood of noise mixed speech is analytically studied, which leads to the reformalization of SS. — Not only the subtraction factor used in conventional SS, but also a novel multiplication factor with elliptic integrals is used. This new SS method can be used alone or together with the conventional SS. The speech recognition experiments use a principal microphone and a reference microphone. The experiments suggest the effectiveness of the mixed method.
منابع مشابه
Leakage from Montgomery Multiplication
Modular multiplication P = A×B mod M is a fundamental operation in most public key cryptography. Its efficiency is usually critical in determining the overall efficiency of a system because it is the main component in modular exponentiation and in elliptic curve point multiplication. There are several algorithms which can be chosen for performing modular multiplication, of which those by Barret...
متن کاملFinding Shorter Addition/Subtraction-Chains
Small Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplication on an elliptic curve cryptosystem is directly proportional to the length of the addition/subtraction-chain. In this paper, we propose an algorithm to find an addition/subtractionchain. The proposed algorithm...
متن کاملVHDL Implementation using Elliptic Curve Point Multiplication
This paper describes synthesizable VDHL implementation of elliptic curve Point Multiplication. Elliptic curves used for ECC are defined over mathematical structures called Galois fields. Based on the theory of ECC, this paper has carried out Modular addition/subtraction, EC Point doubling/addition, Modular multiplicative inversion, EC point multiplier, projective to affine coordinates conversio...
متن کاملExact Analysis of Montgomery Multiplication
The Montgomery multiplication is often used for an efficient implementations of public-key cryptosystems. This algorithm occasionally needs an extra subtraction in the final step, and the correlation of these subtractions can be considered as an invariant of the algorithm. Some side channel attacks on cryptosystems using Montgomery Multiplication has been proposed applying the correlation estim...
متن کاملEnhancing Simple Power-Analysis Attacks on Elliptic Curve Cryptosystems
Recent applications of lattice attacks against elliptic curve cryptosystems have shown that the protection of ephemeral keys in the ECDSA is of greatest importance. This paper shows how to enhance simple power-analysis attacks on elliptic-curve point-multiplication algorithms by using Markov models. We demonstrate the attack on an addition-subtraction algorithm (fixing the sequence of elliptic-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005